Distributed Parallel Metaheuristics based on GRASP and VNS for Solving the Traveling Purchaser Problem
نویسندگان
چکیده
We intend to show in this paper that metaheuristics based on GRASP and VNS can give good results for a generalization of the Traveling Salesman Problem (TSP) called Traveling Purchaser Problem (TPP) when compared with the Tabu Search algorithm proposed by Voss [13] for this algorithm, concerning the quality of solutions in similar execution times. In these algorithms, several simple and well known methods are used to construct an initial solution and also to execute local search.
منابع مشابه
Solving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملEfficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.
متن کاملA distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
The adoption of the same cluster-based programming strategies for grid applications, although requiring minimal effort from a programmer’s point of view, does not always take advantage of the available computational resources to their fullest extent. This paper investigates on the impact of a distributed and hierarchical autonomic strategy on the performance of parallel metaheuristics to solve ...
متن کاملAssesing The Performance of Different S-Metaheuristics To Solve Unrestricted Parallel Identical Machines Scheduling Problem
In this paper we present a comparative study of four trajectory or single-solution based metaheuristics (S-metaheuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS), and Simulated Annealing (SA). These metaheuristics were considered to assess their respective performance to minimize the Maximum Tardiness (Tmax) for the ...
متن کاملApplying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
Variable neigborhood search (VNS) and Greedy randomized adaptive search procedure (GRASP) are among the well studied local search based metaheuristics providing good results for many combinatorial optimization problems throughout the last decade. While they are usually explored in different environments one may encounter quite obvious commonalities. Based on previous successful applications of ...
متن کامل